Введите слово или словосочетание на любом языке 👆
Язык:
Перевод и анализ слов искусственным интеллектом ChatGPT
На этой странице Вы можете получить подробный анализ слова или словосочетания, произведенный с помощью лучшей на сегодняшний день технологии искусственного интеллекта:
- как употребляется слово
- частота употребления
- используется оно чаще в устной или письменной речи
- варианты перевода слова
- примеры употребления (несколько фраз с переводом)
- этимология
Что (кто) такое graph-theoretical model - определение
SET OF ALLOWABLE OPERATIONS USED IN COMPUTATION AND THEIR RESPECTIVE COSTS
Models of computation; Computation model; Machine model; Computational mechanism; Computational formalism; Mathematical model of computation; Theoretical models of computation; Theoretical model of computation
Найдено результатов: 4181
Null graph
GRAPH WITHOUT EDGES (ON ANY NUMBER OF VERTICES)
Empty tree; Empty graph; Null Graph; Null tree; Singleton graph; Edgeless graph; Order-zero graph
In the mathematical field of graph theory, the term "null graph" may refer either to the order-zero graph, or alternatively, to any edgeless graph (the latter is sometimes called an "empty graph").
Turán graph
![The [[octahedron]], a 3-[[cross polytope]] whose edges and vertices form ''K''<sub>2,2,2</sub>, a Turán graph ''T''(6,3). Unconnected vertices are given the same color in this face-centered projection.](https://commons.wikimedia.org/wiki/Special:FilePath/Complex tripartite graph octahedron.svg?width=200 "The [[octahedron]], a 3-[[cross polytope]] whose edges and vertices form ''K''<sub>2,2,2</sub>, a Turán graph ''T''(6,3). Unconnected vertices are given the same color in this face-centered projection.")
GRAPH
Turan graph; Cocktail party graph; Octahedral Graph; Octahedral graph
The Turán graph, denoted by T(n,r), is a complete multipartite graph; it is formed by partitioning a set of n vertices into r subsets, with sizes as equal as possible, and then connecting two vertices by an edge if and only if they belong to different subsets. Where q and s are the quotient and remainder of dividing n by r (so n = qr + s), the graph is of the form K_{q+1, q+1, \ldots, q, q}, and the number of edges is
Dense graph
GRAPH IN WHICH THE NUMBER OF EDGES IS CLOSE TO THE MAXIMUM FOR ITS NUMBER OF VERTICES
Sparse graph; Graph density; Density (graph theory)
In mathematics, a dense graph is a graph in which the number of edges is close to the maximal number of edges (where every pair of vertices is connected by one edge). The opposite, a graph with only a few edges, is a sparse graph.
Butterfly graph
PLANAR GRAPH WITH 5 NODES AND 6 EDGES
Bowtie graph; Hourglass graph; Bowtie-free graphs; Bowtie-free graph
In the mathematical field of graph theory, the butterfly graph (also called the bowtie graph and the hourglass graph) is a planar undirected graph with 5 vertices and 6 edges.ISGCI: Information System on Graph Classes and their Inclusions.
Graph (abstract data type)
ABSTRACT DATA TYPE IN COMPUTER SCIENCE
Weighted, directed graph; Graph (computer science); Graph data structure; Graph (data structure); Graph (data structure; Graph representation
In computer science, a graph is an abstract data type that is meant to implement the undirected graph and directed graph concepts from the field of graph theory within mathematics.
Graph of a function
=−((cosx)^2 + (cosy)^2)^2.PNG?width=200 "Plot of the graph of <math>f(x, y) = - \left(\cos\left(x^2\right) + \cos\left(y^2\right)\right)^2,</math> also showing its gradient projected on the bottom plane.")
![function]] <math>f(x, y) = \sin\left(x^2\right) \cdot \cos\left(y^2\right).</math>](https://commons.wikimedia.org/wiki/Special:FilePath/Three-dimensional graph.png?width=200 "function]] <math>f(x, y) = \sin\left(x^2\right) \cdot \cos\left(y^2\right).</math>")
![interval]] [−2,+3]. Also shown are the two real roots and the local minimum that are in the interval.](https://commons.wikimedia.org/wiki/Special:FilePath/X^4 - 4^x.PNG?width=200 "interval]] [−2,+3]. Also shown are the two real roots and the local minimum that are in the interval.")
REPRESENTATION OF A FUNCTION AS THE SET OF PAIRS (X, F(X))
Graph (function); Graph (functions); Graph of a relation; Function graph; Graphs of functions; Graph of a function of two variables; Graph sketching; Function graphing; Graph of a mapping; Surface plot (mathematics); Graph of a multifunction
In mathematics, the graph of a function f is the set of ordered pairs (x, y), where f(x) = y. In the common case where x and f(x) are real numbers, these pairs are Cartesian coordinates of points in two-dimensional space and thus form a subset of this plane.
Graph traversal
CHECKING AND/OR CHANGING EACH VERTEX IN A GRAPH
Graph exploration algorithm; Graph search algorithm; Graph search; Node traversal
In computer science, graph traversal (also known as graph search) refers to the process of visiting (checking and/or updating) each vertex in a graph. Such traversals are classified by the order in which the vertices are visited.
Graph property
ISOMORPHISM-INVARIANT PROPERTY OF GRAPHS
Graph invariant; Graph properties
In graph theory, a graph property or graph invariant is a property of graphs that depends only on the abstract structure, not on graph representations such as particular labellings or drawings of the graph..
Holt graph
![The [[chromatic number]] of the Holt graph is 3.](https://commons.wikimedia.org/wiki/Special:FilePath/Holt graph 3COL.svg?width=200 "The [[chromatic number]] of the Holt graph is 3.")
![The [[chromatic index]] of the Holt graph is 5.](https://commons.wikimedia.org/wiki/Special:FilePath/Holt graph 5color edge.svg?width=200 "The [[chromatic index]] of the Holt graph is 5.")
![Hamiltonian]].](https://commons.wikimedia.org/wiki/Special:FilePath/Holt graph hamiltonian.svg?width=200 "Hamiltonian]].")
![The Holt graph is a [[unit distance graph]].](https://commons.wikimedia.org/wiki/Special:FilePath/Holt graph unit distance.svg?width=200 "The Holt graph is a [[unit distance graph]].")
NODE-LINK GRAPH WITH 27 VERTICES AND 54 EDGES, THE SMALLEST HALF-TRANSITIVE GRAPH
Doyle graph; Holt's graph
In graph theory, the Holt graph or Doyle graph is the smallest half-transitive graph, that is, the smallest example of a vertex-transitive and edge-transitive graph which is not also symmetric.Doyle, P.
Knight's graph
GRAPH THAT REPRESENTS ALL LEGAL MOVES OF THE KNIGHT ON A CHESSBOARD
Knight's tour graph; Knight graph; Knight tour graph
In graph theory, a knight's graph, or a knight's tour graph, is a graph that represents all legal moves of the knight chess piece on a chessboard. Each vertex of this graph represents a square of the chessboard, and each edge connects two squares that are a knight's move apart from each other.
Википедия
Model of computation
In computer science, and more specifically in computability theory and computational complexity theory, a model of computation is a model which describes how an output of a mathematical function is computed given an input. A model describes how units of computations, memories, and communications are organized. The computational complexity of an algorithm can be measured given a model of computation. Using a model allows studying the performance of algorithms independently of the variations that are specific to particular implementations and specific technology.
